Modulo Counting on Words and Trees
نویسندگان
چکیده
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a technique for deciding the satisfiability problem. In the case of words this gives a new proof of ExpSpace upper bound, and in the case of trees it gives a 2-ExpTime algorithm. This algorithm is optimal: we prove a matching lower bound by a generic reduction from alternating Turing machines working in exponential space; the reduction involves a development of a new version of tiling games.
منابع مشابه
Counting Homomorphisms to Trees Modulo a Prime
Many important graph theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular independent sets and colourings. In this article we study the complexity of #pHomsToH, the problem of counting graph homomorphisms from an input graph to a graph H modulo a prime number p. Dyer and Greenhill proved a dichotomy stating t...
متن کاملExpressive Completeness for LTL With Modulo Counting and Group Quantifiers
Kamp showed that linear temporal logic is expressively complete for first order logic over words. We give a Gabbay style proof to show that linear temporal logic extended with modulo counting and group quantifiers (introduced by Baziramwabo,McKenzie,Thérien) is expressively complete for first order logic with modulo counting (introduced by Straubing, Thérien, Thomas) and group quantifiers (intr...
متن کاملCharacterizing weighted MSO for trees by branching transitive closure logics
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that weighted monadic second order logics on trees is equivalent to the definability by formulas which start with one of the following operators: (i) a branching t...
متن کاملCounting modulo Quantiiers on Nite Structures
We give a combinatorial method for proving elementary equivalence in rst-order logic FO with counting modulo n quantiiers D n. Inexpressibility results for FO(D n) with built-in linear order are also considered. For instance, the class of linear orders of length divisible by n + 1 cannot be expressed in FO(D n). Using this result we prove that comparing cardinalities or connectivity of ordered ...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کامل